On ldog-pa

On (pa, p, pa, pa-1)-Relative Difference Sets

The Regular Viewpoint on Pa−processes the Regular Viewpoint on Pa-processes

PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as tree languages. Our main result is that the set of iterated predecessors of a regular set of PA-processes is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree-automata can be built eeectively in polynomial...

Pa Learning Pa Algorithm with Unlabeled Data

We analyze the combination of online learning and semisupervised learning. Online learning is an approach to supervised machine learning, which is effective at processing a large amount of training data. Semi-supervised learning is employed when a large amount of unlabeled data is available. While both setting occurs frequently in real applications of machine learning, thus far, their theoretic...

Introducing a Lightweight Structural Model via Simulation of Vernacular “Pa Tu Pa” Arch

The knowledge of Iranian vernacular structures is based on geometry, and there is a possibility of recreating such structural patterns aimed at producing movable structures. The purpose of this research was to utilize the patterns of vernacular structures to provide a lightweight structural model. The questions raised included how to create various forms based on the structural history of any r...

On the Functors Cwa and Pa

suspensions of A and attaching cones on suspensions of A (see [5, corollary 3.7]). If A = S, then a relative S–CW–complex is essentially an ordinary relative CW– complex. Any pointed map f : X → Y can be factored as a composition (X → Y ′ p → Y ), where (Y ′, X) is a relative A–CW–complex and p induces a weak equivalence of mapping spaces p? : map?(A, Y ′)→ map?(A, Y ). Let X be a pointed space...